The Combinatorial Seller’s Bid Double Auction: An Asymptotically Efficient Market Mechanism*

نویسندگان

  • Rahul Jain
  • Pravin Varaiya
  • Charis Kaskiris
چکیده

We consider the problem of efficient mechanism design for multilateral trading of multiple goods with independent private types for players and incomplete information among them. The problem is partly motivated by an efficient resource allocation problem in communication networks where there are both buyers and sellers. In such a setting, ex post budget balance and individual rationality are key requirements, while efficiency and incentive compatibility are desirable goals. Such mechanisms are difficult if not impossible to design [34]. We propose a combinatorial market mechanism which in the complete information case is always efficient, budget-balanced, ex post individual rational and “almost” dominant strategy incentive compatible. In the incomplete information case, it is budget-balanced, ex post individual rational and asymptotically efficient and Bayesian incentive compatible. Thus, we are able to achieve efficiency, budget-balance and individual rationality by compromising on incentive compatibility, achieving only a weak version of it. This seems to be the only known combinatorial market mechanism with these properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Incentive-Compatible Combinatorial Market Mechanism

Service providers lease bandwidth from owners of individual links to form desired routes. Bandwidth is leased in indivisible amounts, say multiples of 100 Mbps. We study the interaction between buyers and sellers of bandwidth. Within a conventional market, we showed in [8] that a competitive equilibrium exists if agents’ utilities are linear in bandwidth (and money) and they truthfully reveal t...

متن کامل

Combinatorial Exchange Mechanisms for Efficient Bandwidth Allocation

The size, scale and multiple ownership of communication network resources makes it important to consider an economic framework wherein we can investigate the efficiency of network operation taking agents’ incentives into account. Such a framework has been considered in the design and analysis of pricing mechanisms to regulate congestion and share bandwidth over short time scales. We consider ti...

متن کامل

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

متن کامل

EE 228 a - Lecture 25 - Spring 2006 Combinatorial Auction

This lecture gives a combinatorial market mechanism that is always efficient, budget-balanced, ex post individual rational and ‘almost’ dominant strategy incentive compatible in the complete information case. In the incomplete information case, it is budget-balanced, ex post individual rational and asymptotically efficient and Bayesian incentive compatible. I. THE COMBINATORIAL SELLERS’ BID DOU...

متن کامل

Combinatorial Bandwidth Exchange: Mechanism Design and Analysis *

The size, scale and multiple ownership of communication network resources makes it important to consider an economic framework wherein we can investigate the efficiency of network operation taking agents’ incentives into account. Such a framework has been considered in the design and analysis of pricing mechanisms to regulate congestion and share bandwidth over short time scales. We consider ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006